Advanced weight graph transformation matching algorithm

A Weight Regularized Relaxation Based Graph Matching Algorithm

In this paper we propose a regularized relaxation based graph matching algorithm. The graph matching problem is formulated as a constrained convex quadratic program, by relaxing the permutation matrix to a doubly stochastic one. To gradually push the doubly stochastic matrix back to a permutation one, a simple weighted concave regular term is added to the convex objective function. The concave ...

Designing Advanced Databases Using Dependency Graph Conducted Schema Transformation Algorithm

The RW2 Algorithm for Exact Graph Matching

The RW algorithm has been proposed recently to solve the exact graph matching problem. This algorithm exploits Random Walk theory to compute a topological signature which can be used to match the nodes in two isomorphic graphs. However, the algorithm may suffer from the presence of colliding signatures in the same graph, which may prevent the procedure from finding the complete mapping between ...

A Graduated Assignment Algorithm for Graph Matching

A graduated assignment algorithm for graph matching is presented which is fast and accurate even in the presence of high noise. By combining graduated non-convexity (deterministic annealing), two-way (assignment) constraints, and sparsity, large improvements in accuracy and speed are achieved. Its low order computational complexity (O(lm), where l and m are the number of links in the two graphs...

A GPU Algorithm for Greedy Graph Matching

Greedy graph matching provides us with a fast way to coarsen a graph during graph partitioning. Direct algorithms on the CPU which perform such greedy matchings are simple and fast, but offer few handholds for parallelisation. To remedy this, we introduce a fine-grained shared-memory parallel algorithm for maximal greedy matching, together with an implementation on the GPU, which is faster (spe...